Section: New Results

Formalizing Hanoi towers

Participant : Laurent Théry.

The problem of Hanoi towers is a standard example to explain recursion. While trying to write a formalization, we discovered that there exists an interesting generalisation. Starting with two arbitrary valid positions, the problem is to find an optimal solution to go from one to the other. The solution is somewhat counter-intuitive, and not always unique. We formalized it in Coq.